A probabilistic dynamic logic
نویسندگان
چکیده
منابع مشابه
Probabilistic Dynamic Epistemic Logic
In this paper I combine the dynamic epistemic logic of Gerbrandy (1999) with the probabilistic logic of Fagin and Halpern (1994). The result is a new probabilistic dynamic epistemic logic, a logic for reasoning about probability, information, and information change that takes higher order information into account. Probabilistic epistemic models are defined, and a way to build them for applicati...
متن کاملExtending probabilistic dynamic epistemic logic
This paper aims to extend in two directions the probabilistic dynamic epistemic logic provided in Kooi’s paper [7] and to relate these extensions to ones made in [10]. Kooi’s probabilistic dynamic epistemic logic adds to probabilistic epistemic logic sentences that express consequences of public announcements. The paper [10] extends [7] to using action models, but in both papers, the probabilit...
متن کاملProbabilistic Dynamic Belief Logic for Image and Reputation
Since electronic and open environments became a reality, computational trust and reputation models have attracted increasing interest in the field of multiagent systems (MAS). Some of them are based on cognitive theories of reputation that require cognitive agents to display all their potential. One of them is Repage, a computational system based on a cognitive theory of reputation that focuses...
متن کاملProbabilistic Logic in Dynamic Domains: Particle Filter with Distributional Clauses
We introduce a probabilistic logic programming framework to handle continuous distributions as well as dynamic domains for use in fields like robotics. The framework is based on the recently introduced notion of distributional clauses, an extension of Sato’s distribution semantics. The key contribution of this paper is the introduction of a particle filter for this formalism. The particle filte...
متن کاملAgreeing to disagree in probabilistic dynamic epistemic logic
Aumann’s agreeing to disagree theorem is a central theorem of game theory. This result says that if two agents have a common prior, then they cannot agree (have common knowledge of their posteriors) to disagree (while these posteriors are not identical). This thesis looks at the agreeing to disagree theorem from the perspective of probabilistic dynamic epistemic logic. The first goal of the the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1984
ISSN: 0022-0000
DOI: 10.1016/0022-0000(84)90065-5